Exact Method for Robotic Cell Problem
نویسندگان
چکیده
This study investigates an exact method for the Robotic Cell Problem. We present an exact branch and bound algorithm which is the first exact procedure specifically designed for this strongly NP-hard problem. In this paper, we propose a new mathematical formulation and we describe a new lower bound for the RCP. In addition, we propose a genetic algorithm. We report that the branch and bound algorithm is more effective than the proposed mathematical formulation which can Electronic Notes in Discrete Mathematics 36 (2010) 859–866 1571-0653/$ – see front matter © 2010 Elsevier B.V. All rights reserved. www.elsevier.com/locate/endm doi:10.1016/j.endm.2010.05.109 solve small sized problem. Also, computational study provides evidence that the genetic algorithm delivers reasonably good solutions while requiring significantly shorter CPU times to solve this problem.
منابع مشابه
A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملبهینه سازی هزینه کل تولید و زمان در سلول رباتیک سه ماشین
In this research, robotic cell scheduling problem with three CNC machines and with an operation on each machine with the purpose of optimizing manufacturing cost and time in S1 cycle has been investigated. To obtain the optimal total cost of production has been used the optimal processing time on machine operation. In this research, robotic cell scheduling is studied in three different situatio...
متن کاملTwo-machine robotic cell considering different loading and unloading times
In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...
متن کاملA scalarization-based method for multiple part-type scheduling of two-machine robotic systems with non-destructive testing technologies
This paper analyzes the performance of a robotic system with two machines in which machines are configured in a circular layout and produce non-identical parts repetitively. The non-destructive testing (NDT) is performed by a stationary robotic arm located in the center of the circle, or a cluster tool. The robotic arm integrates multiple tasks, mainly the NDT of the part and its transition bet...
متن کاملExperimental Identification and Hybrid PID-Fuzzy Position Control of Continuum Robotic Arms
Continuum robotic arms that are inspired from nature, have many advantages compared to traditional robots, which motivate researchers in this field. Dynamic modeling and controlling these robots are challenging subjects due to complicated nonlinearities and considerable uncertainties existing in these structures. In this paper, first a dynamic three-dimensional model of the continuum robotic ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 36 شماره
صفحات -
تاریخ انتشار 2010